Defining Asymptotic Parallel Time Complexity of Data-dependent Algorithms
نویسندگان
چکیده
منابع مشابه
Notes on Asymptotic Time Complexity
Thus, f is big O of g if f is bounded above by a constant multiple of g. Intuitively, f(n) = O(g(n)) means that f grows no faster than g as the index n grows. For example, the function f(n) = n2 is big O of the function g(n) = n3, while it is not true that g is big O of f in this case. Every function is big O of itself. The requirement that the inequality in the above definition of big O hold f...
متن کاملthe effects of time planning and task complexity on accuracy of narrative task performance
هدف اصلی این تحقیق بررسی تاثیر برنامه ریزی زمانی، هم چنین افزایش میزان پیچیدگی تکالیف در نظر گرفته شده بصورت همزمان، بر دقت و صحت و پیچیدگی عملکرد نوشتاری زبان آموزان می باشد. بدین منظور، 50 نفر از دانش آموزان دختر در رده ی سنی 16 الی 18 سال به عنوان شرکت کنندگان در این زمینه ی تحقیق در نظر گرفته شدند و به دو گروه آزمایشی و کنترل بصورت اتفاقی تقسیم شدند. اعضای گروه آزمایشی هر دو تکلیف ساده و پی...
Asymptotic Behaviors of the Lorenz Curve for Left Truncated and Dependent Data
The purpose of this paper is to provide some asymptotic results for nonparametric estimator of the Lorenz curve and Lorenz process for the case in which data are assumed to be strong mixing subject to random left truncation. First, we show that nonparametric estimator of the Lorenz curve is uniformly strongly consistent for the associated Lorenz curve. Also, a strong Gaussian approximation for ...
متن کاملComputational complexity of sequential and parallel algorithms
Downloading the book in this website lists can give you more advantages. It will show you the best book collections and completed collections. So many books can be found in this website. So, this is not only this computational complexity of sequential and parallel algorithms. However, this book is referred to read because it is an inspiring book to give you more chance to get experiences and al...
متن کاملParallel Real-Time Complexity Theory
We present a new complexity theoretic approach to real-time computations. We define timed ω-languages as a new formal model for such computations, that we believe to allow a unified treatment of all variants of real-time computations that are meaningful in practice. To our knowledge, such a practically meaningful formal definition does not exist at this time. In order to support our claim that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Generation Computing
سال: 2014
ISSN: 0288-3635,1882-7055
DOI: 10.1007/s00354-014-0202-2